1

Ore-condition and -connectivity

Year:
2008
Language:
english
File:
PDF, 387 KB
english, 2008
2

DP-3-coloring of some planar graphs

Year:
2019
Language:
english
File:
PDF, 416 KB
english, 2019
5

M-degrees of quadrangle-free planar graphs

Year:
2009
Language:
english
File:
PDF, 101 KB
english, 2009
6

Ore-type degree conditions for a graph to be H-linked

Year:
2008
Language:
english
File:
PDF, 155 KB
english, 2008
8

On Minimum Degree Implying That a Graph is H‐Linked

Year:
2006
Language:
english
File:
PDF, 189 KB
english, 2006
9

Medical Appointments.

Year:
1883
Language:
english
File:
PDF, 206 KB
english, 1883
10

Permutations as Product of Parallel Transpositions

Year:
2011
Language:
english
File:
PDF, 113 KB
english, 2011
11

Planar graphs without 5-cycles and intersecting triangles are

Year:
2016
Language:
english
File:
PDF, 447 KB
english, 2016
14

-colorable

Year:
2019
Language:
english
File:
PDF, 455 KB
english, 2019
15

On the First-Fit Chromatic Number of Graphs

Year:
2008
Language:
english
File:
PDF, 228 KB
english, 2008
17

Strong edge-colorings for\(k\)-degenerate graphs

Year:
2015
Language:
english
File:
PDF, 133 KB
english, 2015
18

Covering 2-connected 3-regular graphs with disjoint paths

Year:
2017
Language:
english
File:
PDF, 270 KB
english, 2017
19

Injective Colorings of Graphs with Low Average Degree

Year:
2011
Language:
english
File:
PDF, 554 KB
english, 2011
23

-colorable

Year:
2019
File:
PDF, 455 KB
2019
24

Recent progress on strong edge-coloring of graphs

Year:
2019
Language:
english
File:
PDF, 410 KB
english, 2019
26

Maximum average degree and relaxed coloring

Year:
2017
Language:
english
File:
PDF, 347 KB
english, 2017
27

On strong edge-coloring of graphs with maximum degree 4

Year:
2017
Language:
english
File:
PDF, 479 KB
english, 2017
29

The strong chromatic index of (

Year:
2016
Language:
english
File:
PDF, 298 KB
english, 2016
32

Minimum degree conditions for -linked graphs

Year:
2008
Language:
english
File:
PDF, 158 KB
english, 2008
35

Strong edge-coloring for planar graphs with large girth

Year:
2019
Language:
english
File:
PDF, 269 KB
english, 2019
36

-colorable

Year:
2019
Language:
english
File:
PDF, 412 KB
english, 2019
37

Minimum degree condition for a graph to be knitted

Year:
2019
Language:
english
File:
PDF, 273 KB
english, 2019
41

On the Pagenumber of k -Trees

Year:
2009
Language:
english
File:
PDF, 189 KB
english, 2009
42

A Relaxation of Steinberg's Conjecture

Year:
2013
Language:
english
File:
PDF, 365 KB
english, 2013
47

Planar graphs without 7-cycles and butterflies are DP-4-colorable

Year:
2019
Language:
english
File:
PDF, 1015 KB
english, 2019
49

An Ore-type analogue of the Sauer-Spencer Theorem

Year:
2007
Language:
english
File:
PDF, 108 KB
english, 2007